From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference
نویسندگان
چکیده
We analyze the Brandenburger-Keisler paradox in epistemic game theory, which is a ‘two-person version of Russell’s paradox’. Our aim is to understand how it relates to standard one-person arguments, and why the ‘believes-assumes’ modality used in the argument arises. We recast it as a fixpoint result, which can be carried out in any regular category, and show how it can be reduced to a relational form of the one-person diagonal argument due to Lawvere. We give a compositional account, which leads to simple multi-agent generalizations. We also outline a general coalgebraic approach to the construction of assumption complete models.
منابع مشابه
Some Non-Classical Approaches to the Branderburger-Keisler Paradox
In this paper, we discuss a well-known self-referential paradox in foundational game theory, the Brandenburger Keisler paradox. We approach the paradox from two different perspectives: non-well-founded set theory and paraconsistent logic. We show that the paradox persists in both frameworks for category theoretical reasons, but, with different properties.
متن کاملParaconsistent Topologies for Games
Topological semantics appears to be the first semantics suggested for modal logic in 1938 by Tsao-Chen [9]. Picking up from Tsao-Chen’s work, McKinsey (later with Tarski) incorporated various other algebraic and topological tools into modal logic, always remaining within the limits of classical logic [4, 6, 5, 7]. However, the strength of topological semantics arguably comes from its versatilit...
متن کاملSelf-admissible sets
Best-response sets (Pearce [29, 1984]) characterize the epistemic condition of “rationality and common belief of rationality.” When rationality incorporates a weak-dominance (admissibility) requirement, the self-admissible set (SAS) concept (Brandenburger-Friedenberg-Keisler [18, 2008]) characterizes “rationality and common assumption of rationality.” We analyze the behavior of SAS’s in some ga...
متن کاملAn Impossibility Theorem on Beliefs in Games
A paradox of self-reference in beliefs in games is identified, which yields a game-theoretic impossibility theorem akin to Russell’s Paradox. An informal version of the paradox is that the following configuration of beliefs is impossible: Ann believes that Bob assumes that Ann believes that Bob’s assumption is wrong This is formalized to show that any belief model of a certain kind must have a ...
متن کاملFrom Lawvere to Brandenburger-Keisler: multi-agent forms of diagonalization and self-reference
I will briefly introduce the field of abstract argumentation theory and present a formalization of some fragments of the theory in modal logic. I will show how a number of key notions in argumentation theory can obtain a natural formulation within appropriate modal languages. This opens up the possibility to directly import results and techniques from modal logic to argumentation theory. As exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 81 شماره
صفحات -
تاریخ انتشار 2012